Knight move in chromatic cohomology

In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. HelmeGuizon and Y. Rong. Namely, for a connected graph Γ with n vertices the only non-trivial cohomology groups H(Γ), H(Γ) come in isomorphic pairs: H(Γ) = H(Γ) for i > 0 if Γ is non-bipartite, and for i > 0 if Γ is bipartite. As a corollary, the ranks of the cohomology groups are determined by the chromatic polynomial. At the end, we give an explicit formula for the Poincaré polynomial in terms of the chromatic polynomial and a deletion-contraction formula for the Poincaré polynomial.